About Folding-Unfolding Cuts and Cuts Modulo

About Folding-Unfolding Cuts and Cuts Modulo

Type Two Cuts, Bad Cuts and Very Bad Cuts

Type two cuts, bad cuts and very bad cuts are introduced in [KL] for studying the relationship between Loeb measure and U-topology of a hyper nite time line in an !1-saturated nonstandard universe. The questions concerning the existence of those cuts are asked there. In this paper we answer, fully or partially, some of those questions by showing that: (1) type-two cuts exist, (2) the @1-isomorp...

short cuts

.

Communal Cuts: sharing cuts across images

Identifying objects that are common to a set of images is an important step in unsupervised image analysis. While existing approaches to object extraction and co-segmentation commonly focus merely on joint per-class appearance models, we propose a model that incorporates additional label and boundary co-occurrence information with little additional communication across images. This model admits...

Parametrized Complexity of Length-Bounded Cuts and Multi-cuts

We show that theMinimal Length-Bounded L-But problem can be computed in linear time with respect to L and the tree-width of the input graph as parameters. In this problem the task is to find a set of edges of a graph such that after removal of this set, the shortest path between two prescribed vertices is at least L long. We derive an FPT algorithm for a more general multi-commodity length boun...